Faster Transaction Commit even when Nodes Crash
نویسندگان
چکیده
Atomic broadcasts play a central role in serialisable in-memory transactions. Best performing ones block, when a node crashes, until a new view is installed. We augment a new protocol for uninterrupted progress in the interim period.
منابع مشابه
A ‘liub(log,(N))-2’ Resilient Decentralized Commit Protocol
Conclusions In distributed database systems, commit protocols are used to ensure the transaction atomicity. In the presence of failures, nonblocking commit protocols can guarantee the transaction atomicity without blocking the transaction execution. A (resilient) decentralized nonblocking commit protocol (RDCP) is proposed for distributed database systems. This protocol is based on the hypercub...
متن کاملToken Based Decentralized Non-Blocking Two Phase Commit Protocol
Transactional standards in distributed transactional systems, allows heterogeneous resources to participate in an Atomic Commitment Protocol (ACP). An ACP ensures the atomicity of distributed transactions even in the presence of site failures. Atomic commitment is one of the key functionalities of modern distributed information systems. Two-Phase Commit Protocol (2PC) is a well-known and widely...
متن کاملReduced Hardware Lock Elision
Hardware lock elision (HLE) concurrently executes lock critical sections as hardware transactions, but fallbacks to the original sequential lock fallback path when some hardware transaction fails. Recent software-assisted lock-removal based schemes provide a better concurrency by sacrificing safety (opacity). Hardware transactions can execute at the same time with the lock fallback path as long...
متن کاملDesigning computer networks to avoid partitioning
It is shown that a network can be constructed on a given set of host computers such that the possibility of a network partition resulting from network node and link failure can be ruled out with an arbitrarily high degree of conndence. More precisely, a class of networks is exhibited on any given number of host nodes so that the probability of a network partition decreases exponentially with on...
متن کاملStructuring the Commit Tree for Better Performance of Two Phase Commit Processing
Extensive research has been carried out in search for an efficient atomic commit protocol and many optimizations have been suggested to improve the two-phase commit protocol, either for the normal or failure case. Yet, the performance effects on transaction processing when combining some of these optimizations have not been studied in depth. In this paper, we concentrate on the flattening-of-th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1404.7548 شماره
صفحات -
تاریخ انتشار 2014